A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
نویسندگان
چکیده
منابع مشابه
A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
A variety of metaheuristics have been developed to solve the permutation flow shop problem minimizing total flow time. Iterated local search (ILS) is a simple but powerful metaheuristic used to solve this problem. Fundamentally, ILS is a procedure that needs to be restarted from another solution when it is trapped in a local optimum. A new solution is often generated by only slightly perturbing...
متن کاملApplying Iterated Local Search to the Permutation Flow Shop Problem
Iterated local search (ILS) is a general and powerful metaheuristic which provides an easily implementable way of improving the performance of local search algorithms. In this article we consider the application of ILS to the permutation flow shop problem (FSP), a strongly studied problem in machine scheduling. We experimentally investigate the effect of specific implementation choices in our I...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملIterated Local Search Heuristics for Minimizing Total Completion Time in Permutation and Non-permutation Flow Shops
We study the improvement of non-permutation over permutation schedules in flow shops when minimizing the total completion time. We solve both problems by a two-phase heuristic. The first phase uses an iterated local search to find a good permutation schedule. The second phase explores non-permutation schedules using an effective insertion neighborhood, that permits to anticipate or delay a job ...
متن کاملAn efficient hybrid iterated local search algorithm for the total tardiness blocking flow shop problem
This paper deals with the blocking flow shop problem and proposes an Iterated Local Search (ILS) procedure combined with a variable neighbourhood search (VNS) for the total tardiness minimization. The proposed ILS makes use of a NEH-based procedure to generate the initial solution, uses a local search to intensify the exploration which combines the insertion and swap neighbourhood and uses a pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2013
ISSN: 0305-0548
DOI: 10.1016/j.cor.2012.08.021